منابع مشابه
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems
Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such as the Uniform Sparsest Cut problem where the goal is to minimize the fraction of pairs on opposite sides of the cut that are connected by an edge, there are ...
متن کاملApproximate Lasserre Integrality Gap for Unique Games
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show that the answer is negative if the relaxation is insensitive to a sufficiently small perturbation of the constraints. Specifically, we construct an instance of UNIQUE GAMES with k labels along with an approximate vector s...
متن کاملCandidate Lasserre Integrality Gap For Unique Games
We propose a candidate Lasserre integrality gap construction for the Unique Games problem. Our construction is based on a suggestion in [27] wherein the authors study the complexity of approximately solving a system of linear equations over reals and suggest it as an avenue towards a (positive) resolution of the Unique Games Conjecture. We use a new encoding scheme that we call the real code. T...
متن کاملIntegrality Gaps of Integer Knapsack Problems
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a “typical” knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario.
متن کاملIntegrality Gaps for Bounded Color Matchings
We investigate the performance of two common lift-and-project techniques, the SheraliAdams (SA) and the Balas, Ceria and Cornuéjols (BCC) hierarchies, on the natural linear relaxation of the Bounded Color Matching polyhedron and generalizations. We prove the following unconditional inapproximability results: even a large family of linear programs, generated by an asymptotically linear number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2014
ISSN: 1052-6234,1095-7189
DOI: 10.1137/13093025x